Classical Cut - elimination in the π - calculus Steffen
نویسندگان
چکیده
We study the π-calculus, enriched with pairing, and define a notion of type assignment that uses the type constructor →. We encode the terms of the calculus X into this variant of π, and show that all reduction (cut -elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculu LK, this implies that all proofs in LK have a representation in π. We then enrich the logic with the connector ¬, and show that this also can be represented in π.
منابع مشابه
Classical Cut - elimination in the π - calculus ( In memory of
We define the calculus LK a variant of the calculus X that enjoys the Curry-Howard correspondence for Gentzen’s calculus lk; the variant consists of allowing arbitrary progress of cut over cut. We study the π-calculus enriched with pairing, for which we define a notion of implicative type assignment. We translate the terms of LK into this variant of π, and show that reduction and assignable typ...
متن کاملClassical Cut - elimination in the π - calculus
We study the π-calculus, enriched with pairing, and define a notion of type assignment that uses the type constructor →. We encode the terms of the calculus X into this variant of π, and show that all reduction and assignable types are preserved. Since X enjoys the CurryHoward isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK have a representation in π, and cut-eliminati...
متن کاملRepresenting the Classical Sequent Calculus in the π-calculus
We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK ...
متن کاملFrom X to π Representing the Classical Sequent
We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK ...
متن کاملFrom X to π Representing the Classical Sequent Calculus in the π - calculus
We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK ...
متن کامل